New construction of Boolean function with optimum algebraic immunity
نویسندگان
چکیده
Because of the algebraic attacks, a high algebraic immunity is now an important criteria for Boolean functions used in stream ciphers. In this paper, by using the relationship between some flats and support of a n variables Boolean function f , we introduce a general method to determine the algebraic immunity of a Boolean function and finally construct some balanced functions with optimum algebraic immunity.
منابع مشابه
New Construction of Even-variable Rotation Symmetric Boolean Functions with Optimum Algebraic Immunity
The rotation symmetric Boolean functions which are invariant under the action of cyclic group have been used as components of different cryptosystems. In order to resist algebraic attacks, Boolean functions should have high algebraic immunity. This paper studies the construction of even-variable rotation symmetric Boolean functions with optimum algebraic immunity. We construct ( / 4 3) n ...
متن کاملA First Order Recursive Construction of Boolean Function with Optimum Algebraic Immunity
This paper proposed a first order recursive construction of Boolean function with optimum algebraic immunity. We also show that the Boolean functions are balanced and have good algebraic degrees.
متن کاملA method of construction of balanced functions with optimum algebraic immunity
Because of the recent algebraic attacks, a high algebraic immunity is now an absolutely necessary (but not sufficient) property for Boolean functions used in stream ciphers. A difference of only 1 between the algebraic immunities of two functions can make a crucial difference with respect to algebraic attacks. Very few examples of (balanced) functions with high algebraic immunity have been foun...
متن کاملConstruction and Count of Boolean Functions of an Odd Number of Variables with Maximum Algebraic Immunity
Algebraic immunity has been proposed as an important property of Boolean functions. To resist algebraic attack, a Boolean function should possess high algebraic immunity. It is well known now that the algebraic immunity of an n-variable Boolean function is upper bounded by ⌈ n 2 ⌉ . In this paper, for an odd integer n, we present a construction method which can efficiently generate a Boolean fu...
متن کاملOn the Algebraic Immunity of Boolean Function
In view of the construction requirements of Boolean functions with many good cryptography properties, through the analysis of the relationship between the function values on the vectors with weight not more than d and the algebraic immunity, a method to determine the higher order algebraic immunity function is given. Meanwhile, a method that appropriate change in the function value without redu...
متن کامل